Regular languages definable by Lindström quantifiers
نویسندگان
چکیده
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
منابع مشابه
Lindström Quantifiers and Leaf Language Definability
We show that examinations of the expressive power of logical formulae enriched by Lindström quantifiers over ordered finite structures have a well-studied complexity-theoretic counterpart: the leaf language approach to define complexity classes. Model classes of formulae with Lindström quantifiers are nothing else than leaf language definable sets. Along the way we tighten the best up to now kn...
متن کاملAlgebraic characterization of logically defined tree languages
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindström quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization relies on the usage of preclones, an algebraic structure introduced by the authors in a previous paper, and of the block product operation on preclones. Our re...
متن کاملRegular Languages Definable by Majority Quantifiers with Two Variables
In this paper we consider the class of all regular languages definable by the extended majority quantifier and the order predicate but using only two variables. The main part of the paper is the presentation of a geometric method which is used to show that a given regular language cannot be defined by such formulas. Applying this method we can give a necessary condition in terms of an equation ...
متن کاملA The Tale of the Quantifier Alternation Hierarchy of First-Order Logic over Words
In other words, we ask whether the input language belongs to the class of languages defined by the logic, hence the name of the problem: the F-membership problem. Having an F-membership algorithm in hand amounts to having an effective description of all regular properties that F can express. This is why obtaining a membership algorithm is viewed as the goal to strive for when trying to get a pr...
متن کاملModulo quantifiers over functional vocabularies extending addition
We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the Crane beach property (CBP) if the logic satisfies a normal form (called positional normal form). This not only shows why logics over the addition vocabulary have the CBP but also gives new CBP results, for example for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 37 شماره
صفحات -
تاریخ انتشار 2003